Non-convex Hamilton–Jacobi equations with gradient constraints

نویسندگان

چکیده

We study non-convex Hamilton–Jacobi equations in the presence of gradient constraints and produce new, optimal, regularity results for solutions. A distinctive feature those regards existence a lower bound to norm gradient; it competes with elliptic operator governing problem, affecting This class models relates various important questions finds applications several areas; particular interest is modeling optimal dividends problems multiple insurance companies risk theory singular stochastic control reversible investment models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Hamilton–Jacobi–Bellman equations with convex gradient constraints

We study PDE of the form maxfF.D2u; x/ ! f .x/;H.Du/g D 0 where F is uniformly elliptic and convex in its first argument, H is convex, f is a given function and u is the unknown. These equations are derived from dynamic programming in a wide class of stochastic singular control problems. In particular, examples of these equations arise in mathematical finance models involving transaction costs,...

متن کامل

Regularization With Non-convex Separable Constraints

We consider regularization of nonlinear ill-posed problems with constraints which are non-convex. As a special case we consider separable constraints, i.e. the regularization takes place in a sequence space and the constraint acts on each sequence element with a possibly non-convex function. We derive conditions under which such a constraint provides a regularization. Moreover, we derive estima...

متن کامل

Convex drawings of graphs with non-convex boundary constraints

In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is fixed with a star-shaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. We also prove that every four-connected plane graph whose boundary is fixed with a crown-shaped polygon a...

متن کامل

Nonparametric instrumental regression with non-convex constraints

This paper considers the nonparametric regression model with an additive error that is dependent on the explanatory variables. As is common in empirical studies in epidemiology and economics, it also supposes that valid instrumental variables are observed. A classical example in microeconomics considers the consumer demand function as a function of the price of goods and the income, both variab...

متن کامل

Convex and Non-convex Illuminant Constraints for Dichromatic Colour Constancy

The dichromatic reflectance model introduced by Shafer [16] predicts that the colour signals of most materials fall on a plane spanned by a vector due to the material and a vector that represents the scene illuminant. Since the illuminant is in the span of all dichromatic planes, colour constancy can be achieved by finding the intersection of two or more planes. Unfortunately, this approach has...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nonlinear Analysis-theory Methods & Applications

سال: 2021

ISSN: ['1873-5215', '0362-546X']

DOI: https://doi.org/10.1016/j.na.2021.112362